Linear programming applications in construction sites

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy linear programming and applications

This paper presents a survey on methods for solving fuzzy linear programs. First LP models with soft constraints are discussed. Then LP problems in which coefficients of constraints and/or of the objective function may be fuzzy are outlined. Pivotal questions are the interpretation of the inequality relation in fuzzy constraints and the meaning of fuzzy objectives. In addition to the commonly a...

متن کامل

First step immersion in interval linear programming with linear dependencies

‎We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals‎. ‎Contrary to classical models‎, ‎where parameters can attain any value from the interval domains independently‎, ‎we study problems with linear dependencies between the parameters‎. ‎We present a class of problems that are easily solved by reduction to the classi...

متن کامل

SENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS

In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary. 

متن کامل

Grey prediction in linear programming problems

The purpose of this paper is describes the use of grey pridiction in linear programming problems. Some definitions and concepts of grey system theory are introduced and then, we introduced GM(1,1) and fractional order accumulation into grey model. Due to the fluctuation of prices and the lack of certainty data in the market, optimal production was calculated to optimize the profit from sales us...

متن کامل

Lecture Notes 5 : Applications of Linear Programming

Proof. Let x ∈ P . We show a more general claim: if x tightly fulfills r independent constraints, then x can be expressed as a convex combination of at most n+ 1− r vertices. Substituting r = 0 we get the theorem. We prove the claim by induction on r, where the basis is r = n and we decrease r in each step. The basis of the induction is r = n and thus n constraints are fulfilled tightly. By the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Alexandria Engineering Journal

سال: 2018

ISSN: 1110-0168

DOI: 10.1016/j.aej.2018.11.006